Geometric vertex decomposition and liaison

نویسندگان

چکیده

Geometric vertex decomposition and liaison are two frameworks that have been used to produce similar results about families of algebraic varieties. In this paper, we establish an explicit connection between these approaches. particular, show each geometrically decomposable ideal is linked by a sequence elementary G-biliaisons height 1 indeterminates and, conversely, every G-biliaison certain type gives rise geometric decomposition. As consequence, can immediately conclude several well-known ideals glicci, including Schubert determinantal ideals, defining varieties complexes, graded lower bound cluster algebras.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric vertex decompositions

We relate vertex decompositions of simplicial complexes to Gröbner degeneration, in stages, of affine varieties. v cone on the link deletion

متن کامل

The Balanced Decomposition Number and Vertex Connectivity

The balanced decomposition number f(G) of a graph G was introduced by Fujita and Nakamigawa [Discr. Appl. Math., 156 (2008), pp. 3339-3344]. A balanced colouring of a graph G is a colouring of some of the vertices of G with two colours, such that there is the same number of vertices in each colour. Then, f(G) is the minimum integer s with the following property: For any balanced colouring of G,...

متن کامل

The geometric mean decomposition

Given a complex matrix H, we consider the decomposition H=QRP∗ where Q and P have orthonormal columns, and R is a real upper triangular matrix with diagonal elements equal to the geometric mean of the positive singular values of H. This decomposition, which we call the geometric mean decomposition, has application to signal processing and to the design of telecommunication networks. The unitary...

متن کامل

Geometric interpretation of vertex operator algebras.

In this paper, Vafa's approach to the formulation of conformal field theories is combined with the formal calculus developed in Frenkel, Lepowsky, and Meurman's work on the vertex operator construction of the Monster to give a geometric definition of vertex operator algebras. The main result announced is the equivalence between this definition and the algebraic one in the sense that the categor...

متن کامل

Geometric Constraint Solving via Decomposition and Assembly

In this paper, we propose a general scheme to solve geometric constraint problems. First, we decompose a geometric constraint problem into a c-tree. With this c-tree, solution of the constraint problem is reduced to the solution of general construction sequences. To solve a general construction sequence, we need to solve certain kind of basic merge patterns. One of the basic merge pattern is ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Forum of Mathematics, Sigma

سال: 2021

ISSN: ['2050-5094']

DOI: https://doi.org/10.1017/fms.2021.53